Specification and Verification of Interaction Protocols: a Computational Logic Approach Based on Abduction

In this paper we propose a logic-based approach for the specification and verification of interaction protocols. We give the syntax of the proposed language, declarative and operational semantics of an abductive proof procedure for compliance verification. The proof procedure uses constraints for efficiently dealing with large-scale problems, and is implemented in Constraint Handling Rules. We give an example of specification and on-the-fly verification of compliance in a negotiation protocol.